Succinctness of two-way probabilistic and quantum finite automata
نویسندگان
چکیده
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Succinctness of two-way probabilistic and quantum finite automata Abuzer Yakaryilmaz, A. C. Cem Say
منابع مشابه
On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
We investigate the succinctness of several kinds of unary automata by studying their state complexity in accepting the family {Lm} of cyclic languages, where Lm = {a | k ∈ N}. In particular, we show that, for any m, the number of states necessary and sufficient for accepting the unary language Lm with isolated cut point on one-way probabilistic finite automata is p1 1 +p α2 2 + · · ·+ps s , wit...
متن کاملState succinctness of two-way finite automata with quantum and classical states
Two-way quantum automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous in 2002. In this paper we study state succinctness of 2QCFA. For any m ∈ Z and any < 1/2, we show that: 1. there is a promise problem A(m) which can be solved by a 2QCFA with one-sided error in a polynomial expected running time with a constant number (that depends neither on m nor on ε) o...
متن کاملQuantum Finite Automata with One-Sided Unbounded Error
We prove that several variants of the quantum finite automaton (QFA) model are strictly superior to their probabilistic counterparts, in terms of both language recognition power and succinctness, in the one-sided unbounded error setting. This is the first case where one-way QFA models have been shown to outperform the corresponding probabilistic automata in both these respects. We give a charac...
متن کاملFrom Quantum Query Complexity to State Complexity
State complexity of quantum finite automata is one of the interesting topics in studying the power of quantum finite automata. It is therefore of importance to develop general methods how to show state succinctness results for quantum finite automata. One such method is presented and demonstrated in this paper. In particular, we show that state succinctness results can be derived out of query c...
متن کاملWeighted Automata – Theory and Applications Leipzig , March 27 – 31 , 2006
Quantum automata are, on one side, models of automata that go, in a natural way, beyond models of probabilistic automata and, on the other side, a natural way to get a deeper inside into the power of different quantum information processing features and phenomena. One can also say that, on one side, study of quantum automata is a natural way how to utilize further and sharpen techniques that ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 12 شماره
صفحات -
تاریخ انتشار 2010